Monomial Ideals of Weighted Oriented Graphs
نویسندگان
چکیده
منابع مشابه
Monomial Ideals and Planar Graphs
Ezra Miller and Bernd Sturmfels Department of Mathemati s, University of California, Berkeley CA 94720, USA enmiller math.berkeley.edu, bernd math.berkeley.edu Abstra t. Gr obner basis theory redu es questions about systems of polynomial equations to the ombinatorial study of monomial ideals, or stair ases. This arti le gives an elementary introdu tion to urrent resear h in this area. After re...
متن کاملMonomial Ideals
Monomial ideals form an important link between commutative algebra and combinatorics. In this chapter, we demonstrate how to implement algorithms in Macaulay 2 for studying and using monomial ideals. We illustrate these methods with examples from combinatorics, integer programming, and algebraic geometry.
متن کاملAssociated primes of monomial ideals and odd holes in graphs
Let G be a finite simple graph with edge ideal I (G). Let I (G)∨ denote the Alexander dual of I (G). We show that a description of all induced cycles of odd length in G is encoded in the associated primes of (I (G)∨)2. This result forms the basis for a method to detect odd induced cycles of a graph via ideal operations, e.g., intersections, products and colon operations. Moreover, we get a simp...
متن کاملPlanar Graphs as Minimal Resolutions of Trivariate Monomial Ideals
We introduce the notion of rigid embedding in a grid surface, a new kind of plane drawing for simple triconnected planar graphs. Rigid embeddings provide methods to (1) find well-structured (cellular, here) minimal free resolutions for arbitrary monomial ideals in three variables; (2) strengthen the Brightwell–Trotter bound on the order dimension of triconnected planar maps by giving a geometri...
متن کاملSplittings of Monomial Ideals
We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire’s splitting approach. As applications, we show that edge ideals of graphs are splittable, and we provide an iterative method for computing the Betti numbers of the cover ideals of Cohen-Macaulay bi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Electronic Journal of Combinatorics
سال: 2019
ISSN: 1077-8926
DOI: 10.37236/8479